Using interval weights in MADM problems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Flow Problems using Multiplicative Weights

We saw that using the multiplicative weights (MW) algorithm, we find a (1 + ε)-approximate max flow f̂—i.e., a flow of value F that has f̂e ≤ 1 + ε—using O( logm ε2 ) calls to the oracle. In Lecture #14, we saw that using shortest-path routing, you can get ρ = F . Since we can use Dijkstra’s O(m+ n log n) to implement the oracle, this gives an Õ( ε2 ) time algorithm. Relaxed Oracle: For the rest ...

متن کامل

Resolution of nonlinear interval problems using symbolic interval arithmetic

An interval problem is a problem where the unknown variables take interval values. Such a problem can be defined by interval constraints, such as "the interval [a, b] ⊂ [a, b]2". Interval problems often appear when we want to analyze the behavior of an interval solver. To solve interval problems, we propose to transform the constraints on intervals into constraints on their bounds. For instance...

متن کامل

Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights

This paper deals with a general combinatorial optimization problem in which closed intervals and fuzzy intervals model uncertain element weights. The notion of a deviation interval is introduced, which allows us to characterize the optimality and the robustness of solutions and elements. The problem of computing deviation intervals is addressed and some new complexity results in this field are ...

متن کامل

Solving discrete minimax problems using interval arithmetic

We present an interval algorithm for solving discrete minimax problems where the constituent minimax functions are continuously differentiable functions of one real variable. Our approach is based on smoothing the max-type function by exploiting the Jaynes’s maximum entropy [Phys. Rev., 106:620–630, 1957]. The algorithm works within the branchand-bound framework and uses first order information...

متن کامل

Gaussian interval quadrature rule for exponential weights

Interval quadrature formulae of Gaussian type on R and R+ for exponential weight functions of the form w(x) = exp(−Q(x)), where Q is a continuous function on its domain and such that all algebraic polynomials are integrable with respect to w, are considered. For a given set of nonoverlapping intervals and an arbitrary n, the uniqueness of the n-point interval Gaussian rule is proved. The result...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Industrial Engineering

سال: 2019

ISSN: 0360-8352

DOI: 10.1016/j.cie.2019.07.035